Diagonal-complete latin squares
نویسندگان
چکیده
منابع مشابه
Fast Algorithm for Enumerating Diagonal Latin Squares of Small Order
In this paper we propose an algorithm for enumerating diagonal Latin squares of small order. It relies on specific properties of diagonal Latin squares to employ symmetry breaking techniques, and on several heuristic optimizations and bit arithmetic techniques to make use of computational power of stateof-the-art CPUs. Using this approach we enumerated diagonal Latin squares of order at most 9,...
متن کاملOn the existence of self-orthogonal diagonal Latin squares
A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. A Latin square is self-orthogonal if it is orthogonal to its transpose. In an earlier paper Danhof, Phillips and Wallis considered the question of the existence of self-orthogonal diagonal Latin squares of order 10. In this paper we shall present some constructions of self-orthogonal diagonal ...
متن کاملNew bounds for pairwise orthogonal diagonal Latin squares
A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. Let dr be the least integer such that for all n > dr there exist r pairwise orthogonal diagonal Latin squares of order n. In a previous paper Wallis and Zhu gave several bounds on the dr. In this paper we shall present some constructions of pairwise orthogonal diagonal Latin squares and conseq...
متن کاملSome New Row-Complete Latin Squares
A row-complete Latin square (RCLS) of order n, L, is a Latin square in which for any two distinct symbols, X, y, there exist i, j, 1 <i < ~1, 1 <:j < n 1 such that L(i,j) k x and L(i,j I1) =y. Column complete Latin squares are defmed analogously, and a square is complete if it is both. row and column complete. RCLS are used in statistics for the design of sequential experiments. A finite group ...
متن کاملOn Some Features of Symmetric Diagonal Latin Squares
In this paper, we study the dependencies of the number of symmetric and doubly symmetric diagonal Latin squares on the order N. Using fast generator of diagonal Latin squares (augmented by symmetry checker), we determined these dependencies for order at most 8. We also found a number of doubly symmetric diagonal Latin squares of orders 12, 16 and 20.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2003
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(03)00025-8